Dijkstra and Bidirectional Dijkstra on Determining Evacuation Routes

Abstract Determination of the best path or often called shortest finding is a method that has many benefits and can be applied in various cases fields science. In previous studies, authors have developed program using algorithms, such as held-karp, iterative deepening search, bidirectional depth first search limited search. this research author implements on information system for determining fire disaster evacuation route Dijkstra Dijkstra. The was based web vuetify.js framework. Both algorithms were tested several datasets results will compared to find out strengths weaknesses. Based research, algorithm successfully framework datasets, it known 40% test show better than Dijkstra, 10% vice versa 50% get same from both algorithms. From comparison concluded This succeeded proving produce standard classic algorithm.